Technical Report No. 2010-567 State Complexity of Unranked Tree Automata
نویسندگان
چکیده
We consider the representational state complexity of unranked tree automata. The bottomup computation of an unranked tree automaton may be either deterministic or nondeterministic, and further variants arise depending on whether the horizontal string languages defining the transitions are represented by a DFA or an NFA. Also, we consider for unranked tree automata the alternative syntactic definition of determinism introduced by Cristau et al. We establish upper and lower bounds for the state complexity of conversions between different types of unranked tree automata.
منابع مشابه
Technical Report No. 2011-577 State Complexity of Star and Quotient Operation for Unranked Tree Automata
We consider the state complexity of extensions of the Kleene star and quotient operations to unranked tree languages. Due to the nature of the tree structure, there are two distinct ways to define the star operation for trees, we call these operations, respectively, bottom-up and top-down star. We show that (n+ 3 2 )2 states are sufficient and necessary in the worst case to recognize the bottom...
متن کاملOperational State Complexity of Deterministic Unranked Tree Automata
We consider the state complexity of basic operations on tree languages recognized by deterministic unranked tree automata. For the operations of union and intersection the upper and lower bounds of both weakly and strongly deterministic tree automata are obtained. For tree concatenation we establish a tight upper bound that is of a different order than the known state complexity of concatenatio...
متن کاملTransformations Between Different Models of Unranked Bottom-Up Tree Automata
We consider the representational state complexity of unranked tree automata. The bottom-up computation of an unranked tree automaton may be either deterministic or nondeterministic, and further variants arise depending on whether the horizontal string languages defining the transitions are represented by a DFA or an NFA. Also, we consider for unranked tree automata the alternative syntactic def...
متن کاملSeries, Weighted Automata, Probabilistic Automata and Probability Distributions for Unranked Trees
We study tree series and weighted tree automata over unranked trees. The message is that recognizable tree series for unranked trees can be defined and studied from recognizable tree series for binary representations of unranked trees. For this we prove results of [1] as follows. We extend hedge automata – a class of tree automata for unranked trees – to weighted hedge automata. We define weigh...
متن کاملMinimizing Tree Automata for Unranked Trees
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. We start with the unranked tree automata (UTAs) that are standard in database theory, assuming bottomup determinism and that horizontal recursion is represented by deterministic finite automata. We show that minimal UTAs in that class are n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010